Scalable multirobot planning for informed spatial sampling
نویسندگان
چکیده
This paper presents a distributed scalable multi-robot planning algorithm for informed sampling of quasistatic spatials fields. We address the problem efficient data collection using multiple autonomous vehicles and consider effects communication between robots, acting independently, on overall performance team. focus where robots operate independent their teammates, but have ability to communicate current state other neighbors within fixed range. Our proposed approach is adaptive various environmental scenarios, changing robot team configurations, runs in real-time, which are important features many real-world applications. compare our baseline strategies through simulated experiments that utilize models derived from both synthetic field deployment data. The results show even when operating with limited range, thus demonstrating scalability method large-scale environments.
منابع مشابه
Informed Sampling for Asymptotically Optimal Path Planning
Anytime almost-surely asymptotically optimal planners, such as RRT*, incrementally find paths to every state in the search domain. This is inefficient once an initial solution is found as then only states that can provide a better solution need to be considered. Exact knowledge of these states requires solving the problem but can be approximated with heuristics. This paper formally defines thes...
متن کاملRealtime Informed Path Sampling for Motion Planning Search
Robot motions typically originate from an uninformed path sampling process such as random or low-dispersion sampling. We demonstrate an alternative approach to path sampling that closes the loop on the expensive collision-testing process. Although all necessary information for collision-testing a path is known to the planner, that information is typically stored in a relatively unavailable form...
متن کاملInformed Development of Meta Heuristics for Spatial Forest Planning Problems
In this research application paper, the usefulness of an intelligent mechanism (a cubic spline smoothing technique) for determining when to switch from one algorithm to another within a meta heuristic search process is explored. We concentrated on a typical planning problem for a southern United States forestry company where the net present value of management activities is maximized subject to...
متن کاملMeet Point Planning for Multirobot Coordination
We present an approach for determining optimal meet points for a team of agents performing coordinated tasks in an environment. Such points represent the best locations at which the team should meet in order to complete their current task. We develop analytic solutions for finding these meet points and describe how these techniques can be applied to several different multi-agent coordination sc...
متن کاملSubdimensional expansion for multirobot path planning
Planning optimal paths for large numbers of robots is computationally expensive. In this paper, we introduce a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Robots
سال: 2022
ISSN: ['0929-5593', '1573-7527']
DOI: https://doi.org/10.1007/s10514-022-10048-7